package com.dyz.leetcode;

import java.util.HashMap;

/**
 * @author: daiyizheng
 * @date: 2021/7/9 20:01
 * @description:
 */
public class TwoSum01 {
    //hashmap来存储值和位置
    public int[] twoSum(int[] nums, int target) {
        if(nums==null||nums.length==0){return new int[2];}
        HashMap<Integer, Integer> map = new HashMap<>();
        int [] res = new int[2];
        for(int i=0;i<nums.length;i++){
            if(map.containsKey(target-nums[i])){
                res[0] = map.get(target-nums[i]);
                res[1] = i;
                return res;
            }else {
                map.put(nums[i],i);
            }
        }
        return res;
    }
}
